An Enhanced Graph Routing Topology Based Energy Management in Wire - lesshart

WirelessHART is an emerging wireless sensor network protocol. As a crucial technique for wireless networks, energy consumption is an important role especially in WirelessHART networks. The graph routing technology can be provided abundant redundant path to improve the reliability of the wirelessHart network communication. Based on graph routing network topology in this paper we propose Joint Graph Routing (JGR) algorithm for maximizing the network lifetime by taking into account the remaining energy and communication load of neighbor nodes as well as the transmission power of the route in WirelessHART networks. The node communication load, the link transmission power, and the residual energy are joined as a link cost function that is accurately measured in this algorithm. So a node always chooses the ideal next hop by comparing the link cost function of all its neighboring nodes, which guarantees the energy balancing of the entire network. Also we are using Greedy Heuristic based Minimum Load Graph Route (MLGR) algorithm for increase the efficiency of routing. Our experimental result shows that JGR and MLGR algorithms can effectively reduce the energy consumption of a single route and it provides maximum network lifetime.